Convergence of Non-Elitist Strategies

نویسنده

  • Günter Rudolph
چکیده

| This paper oers suucient conditions to prove global convergence of non{elitist evolutionary algorithms. If these conditions can be applied they yield bounds of the convergence rate as a by{product. This is demonstrated by an example that can be calculated exactly. KeyWords| global convergence, non{elitist evolutionary algorithm , martingale theory

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence of Non{elitist Strategies G Unter Rudolph

| This paper ooers suucient conditions to prove global convergence of non{elitist evolutionary algorithms. If these conditions can be applied they yield bounds of the convergence rate as a by{product. This is demonstrated by an example that can be calculated exactly. KeyWords| global convergence, non{elitist evolutionary algorithm , martingale theory

متن کامل

Convergence in evolutionary programs with self-adaptation.

Evolutionary programs are capable of finding good solutions to difficult optimization problems. Previous analysis of their convergence properties has normally assumed the strategy parameters are kept constant, although in practice these parameters are dynamically altered. In this paper, we propose a modified version of the 1/5-success rule for self-adaptation in evolution strategies (ES). Forma...

متن کامل

EMCSO: An Elitist Multi-Objective Cat Swarm Optimization

This paper introduces a novel multi-objective evolutionary algorithm based on cat swarm optimizationalgorithm (EMCSO) and its application to solve a multi-objective knapsack problem. The multi-objective optimizers try to find the closest solutions to true Pareto front (POF) where it will be achieved by finding the less-crowded non-dominated solutions. The proposed method applies cat swarm optim...

متن کامل

Adaptive Diversity of Genetic Algorithm for QoS-based Cloud Service Selection

An elitist selection adaptive Genetic Algorithm is presented to select an optimal cloud service composite plan from a lot of composite plans on the basis of global Qualityof-Service (QoS) constraints. In this Algorithm, some strategies are provided to improve convergence and population diversity and raise fitness result. These strategies include an elitist selection strategy, an individual sele...

متن کامل

Convergence of a Discretized Self-Adaptive Evolutionary Algorithm on Multi-Dimensional Problems

We consider the convergence properties of a non-elitist self-adaptive evolutionary strategy (ES) on multi-dimensional problems. In particular, we apply our recent convergence theory for a discretized (1, λ)-ES to design a related (1, λ)-ES that converges on a class of seperable, unimodal multi-dimensional problems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994